Assessment of Protein Domain Classifications: SCOP, CATH, Dali and EVEREST
نویسندگان
چکیده
Background: SCOP is a manual classification of protein domain structures. CATH is a classification of protein domain structures created through a combination of manual and automatic methods. The Dali Domain Classification (henceforth Dali) is an automatically generated classification of protein domain structures. EVEREST is an automatically generated classification of protein domains that uses sequence information alone. We present a systematic comparison of the aforementioned systems. Methodology / Principal Findings: We focus on the proper classification of each domain, rather than on the exact determination of its boundaries. We show a tradeoff between the granularity of classification and the level of agreement among the classification systems the coarser the granularity, the lower the agreement. SCOP and CATH generally agree with each other at fine and medium granularity levels of their hierarchies, but disagree at coarser levels. The agreement among SCOP and CATH exceeds the quality of matching between Dali to either one of them at each given granularity level. Furthermore, nearly all Dali families are of fine granularity. Although EVEREST uses no structural information, it agrees with SCOP to the same degree as does Dali. EVEREST’s agreement with CATH even exceeds that of Dali. The granularity of EVEREST families is generally between SCOP family level and the CATH S level. Conclusions: The medium granularity levels form a twilight zone where SCOP and CATH agree, whereas the automatic methods do not match them. Beyond that twilight zone the disagreement between SCOP and CATH becomes so high that no global reference is available. We suggest that a reconsideration of the classifications at these levels is due. EVEREST, a sequence-only method performs as well or better than Dali, a structure-only method. All data files generated during this study are available at http://www.everest. cs.huji.ac.il/3d-assessment/.
منابع مشابه
A consensus view of fold space: combining SCOP, CATH, and the Dali Domain Dictionary.
We have determined consensus protein-fold classifications on the basis of three classification methods, SCOP, CATH, and Dali. These classifications make use of different methods of defining and categorizing protein folds that lead to different views of protein-fold space. Pairwise comparisons of domains on the basis of their fold classifications show that much of the disagreement between the cl...
متن کاملFSSP to SCOP and CATH (F2CS) Prediction Server
Summary: The F2CS server provides access to the software, F2CS2.00, that implements an automated prediction method of SCOP and CATH classifications of proteins, based on their FSSP Z-scores (Getz et al., 2002), Availability: Free, at http://www.weizmann.ac.il/physics/complex/compphys/f2cs/. Contact: [email protected] Supplementary information: The site contains links to additional fig...
متن کاملA comparison of SCOP and CATH with respect to domain-domain interactions.
The analysis and prediction of protein-protein interaction sites from structural data are restricted by the limited availability of structural complexes that represent the complete protein-protein interaction space. The domain classification schemes CATH and SCOP are normally used independently in the analysis and prediction of protein domain-domain interactions. In this article, the effect of ...
متن کاملEVEREST: a collection of evolutionary conserved protein domains
Protein domains are subunits of proteins that recur throughout the protein world. There are many definitions attempting to capture the essence of a protein domain, and several systems that identify protein domains and classify them into families. EVEREST, recently described in Portugaly et al. (2006) BMC Bioinformatics, 7, 277, is one such system that performs the task automatically, using prot...
متن کامل117. Consensus approach for benchmarking domain assignment in protein structures
Introduction Assignment of domains in protein structures remains to be a difficult and unsolved problem. Existing algorithms frequently produce contradicting results, different from expert’s assignment. In this work we examine trends in the performance of a new generation of completely automated domain assignment algorithms. We have benchmarked the following automatic methods: DALI [3], DomainP...
متن کامل